Safe Bounds in Semidefinite Programming by Using Interval Arithmetic
نویسندگان
چکیده
منابع مشابه
Bounds for Codes by Semidefinite Programming
Delsarte’s method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming problem. This method allows to improve some l...
متن کاملInterval Enclosures of Upper Bounds of Roundoff Errors using Semidefinite Programming
A longstanding problem related to floating-point implementation of numerical programs is to provide efficient yet precise analysis of output errors. We present a framework to compute lower bounds of absolute roundoff errors for numerical programs implementing polynomial functions with box constrained input variables. Our study relies on semidefinite programming (SDP) relaxations and is compleme...
متن کاملInterval Linear Programming with generalized interval arithmetic
Generally, vagueness is modelled by a fuzzy approach and randomness by a stochastic approach. But in some cases, a decision maker may prefer using interval numbers as coefficients of an inexact relationship. In this paper, we define a linear programming problem involving interval numbers as an extension of the classical linear programming problem to an inexact environment. By using a new simple...
متن کاملSemidefinite programming and arithmetic circuit evaluation
A rational number can be naturally presented by an arithmetic computation (AC): a sequence of elementary arithmetic operations starting from a fixed constant, say 1. The asymptotic complexity issues of such a representation are studied e.g. in [2, 9] in the framework of the algebraic complexity theory over arbitrary field. Here we study a related problem of the complexity of performing arithmet...
متن کاملDynamic Bounds on Stochastic Chemical Kinetic Systems Using Semidefinite Programming
The method of moments has been proposed as a potential means to reduce the dimensionality of the chemical master equation (CME) appearing in stochastic chemical kinetics. However, attempts to apply the method of moments to the CME usually result in the so-called closure problem. Several authors have proposed moment closure schemes, which allow them to obtain approximations of quantities of inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2014
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2014.45028